A Calculus for Concurrent System with Higher-Order Streaming Communication

نویسنده

  • Masaki Murakami
چکیده

This paper presents a formal model of concurrent system that is equipped with capabilities of sending and receiving higher-order terms. That is a modification of the asynchronous higher order π-calculus. A new operation : input streaming is introduced. An input process consists of an input stream and a process P . It can receive a higher order term t during the execution of P . Input prefix and output process are also modified to represent non-atomic communication. The calculus models computations transferring mobile codes and links on a wide-area network in asynchronous manner. A labeled transition system (lts) is presented for the operational semantics. Equivalence relations based on the lts are intorduced. The equivalences are based on the idea of berbed bisimulation that is suitable for non atomic/asynchronous communicationg systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Termination in Higher-Order Concurrent Calculi

We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing concurrent calculi. However, in contrast with the λ-calculus, a simply-typed discipline need not guarantee termination; and, in contrast with message-passing calculi such as the π-calculus, divergence can be obtained even without...

متن کامل

A Foundation for Higher-order Concurrent Constraint Programming

c Deutsches Forschungszentrum für K ¨ unstliche Intelligenz 1994 This work may not be copied or reproduced in whole of part for any commercial purpose. Permission to copy in whole or part without payment of fee is granted for nonprofit educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of the Deutsc...

متن کامل

On Compilation of Higher-Order Concurrent Programs into First Order Programs Preserving Scope Equivalence

This paper discusses the expressive power of a graph rewriting model of concurrent processes with higherorder communication. As we reported before, it is difficult to represent the scopes of names using models based on process algebra. Then we presented a model of concurrent systems based on graph rewriting. The model makes it possible to represent the scopes of names precisely. We defined an e...

متن کامل

A Session Object Calculus for Structured Communication-Based Programming

We present an object calculus for structured concurrent programming, facilitating the implementation of typed binary protocols, known as sessions. Session types are based on a concept of duality of interactions, providing a powerful type-theoretic foundation for guaranteeing well-behaved parallel composition of communicating code. Our formalism extends the Abadi and Cardelli imperative object c...

متن کامل

A Confluent Relational Calculus for Higher-Order Programming with Constraints

We present the-calculus, a relational calculus parametrized with a logical constraint system. The-calculus provides for higher-order relational programming with rst-order constraints, and subsumes higher-order functional programming as a special case. It captures important aspects of the concurrent constraint programming language Oz. We prove the uniform connuence of the-calculus. Uniform connu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Sci. Comput. Program.

دوره 57  شماره 

صفحات  -

تاریخ انتشار 2004